The fixpoint completion fix(P) of a normal logic program P is a programtransformation such that the stable models of P are exactly the models of theClark completion of fix(P). This is well-known and was studied by Dung andKanchanasut (1989). The correspondence, however, goes much further: TheGelfond-Lifschitz operator of P coincides with the immediate consequenceoperator of fix(P), as shown by Wendt (2002), and even carries over to standardoperators used for characterizing the well-founded and the Kripke-Kleenesemantics. We will apply this knowledge to the study of the stable semantics,and this will allow us to almost effortlessly derive new results concerningfixed-point and metric-based semantics, and neural-symbolic integration.
展开▼
